Theoretical Bounds in Minimax Decentralized Hypothesis Testing

Asymptotically Minimax Robust Hypothesis Testing

The design of asymptotically minimax robust hypothesis testing is formalized for the Bayesian and Neyman-Pearson tests of Type I and II. The uncertainty classes based on the KL-divergence, αdivergence, symmetrized α-divergence, total variation distance, as well as the band model, moment classes and p-point classes are considered. It is shown with a counterexample that minimax robust tests do no...

Minimax hypothesis testing for curve registration

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

Decentralized Hypothesis Testing in Sensor Networks

Wireless sensor networks (WSNs) play an important role in the future of Internet of Things IoT systems, in which an entire physical infrastructure will be coupled with communication and information technologies. Smart grids, smart homes, and intelligent transportation systems are examples of infrastructure that will be connected with sensors for intelligent monitoring and management. Thus, sens...

Decentralized Sequential Hypothesis Testing in Discrete Time

In this work we deal with the problem of decentralized sequential hypothesis testing in discrete time in the case that the sensors have full local memory. We adopt the scheme called Decentralized Sequential Probability Ratio Test (D-SPRT), which entails asynchronous communication of the sensors with the fusion center at random times. We prove that the D-SPRT is asymptotically optimal and we sho...

Hypothesis Testing for Arbitrary Bounds